A Hybrid Swarm Based Approach in Addressing University Timetabling Problems

This paper is concerned with the application of an automated hybrid approach in addressing the university timetabling problem. The approach described is based on the nature-inspired artificial bee colony (ABC) algorithm. An ABC algorithm is a biologically-inspired optimization approach, which has been widely implemented in solving a range of optimization problems in recent years such as job shop scheduling and machine timetabling problems. Although the approach has proven to be robust across a range of problems, it is acknowledged within the literature that there currently exist a number of inefficiencies regarding the exploration and exploitation abilities. These inefficiencies can often lead to a slow convergence speed within the search process. Hence, this paper introduces a variant of the algorithm which utilizes a global best model inspired from particle swarm optimization to enhance the global exploration ability while hybridizing with the great deluge (GD) algorithm in order to improve the local exploitation ability. Using this approach, an effective balance between exploration and exploitation is attained. In addition, a traditional local search approach is incorporated within the GD algorithm with the aim of further enhancing the performance of the overall hybrid method. To evaluate the performance of the proposed approach, two diverse university timetabling datasets are investigated, i.e., Carter's examination timetabling and Socha course timetabling datasets. It should be noted that both problems have differing complexity and different solution landscapes. Experimental results demonstrate that the proposed method is capable of producing high quality solutions across both these benchmark problems, showing a good degree of generality in the approach. Moreover, the proposed method produces best results on some instances as compared with other approaches presented in the literature.

A new Nawaz–Enscore–Ham-based heuristic for permutation flow-shop problem with bicriteria of makespan and machine idle-time

A new heuristic based on Nawaz–Enscore–Ham (NEH) algorithm is proposed for solving permutation flowshop scheduling problem in this paper. A new priority rule is proposed by accounting for the average, mean absolute deviation, skewness and kurtosis, in order to fully describe the distribution style of processing times. A new tie-breaking rule is also introduced for achieving effective job insertion for the objective of minimizing both makespan and machine idle-time. Statistical tests illustrate better solution quality of the proposed algorithm, comparing to existing benchmark heuristics.

'A Job in Politics is not for Woman': Analysing Barriers to Women's Political Representation in CEE

This article discusses women’s political representation in Central and Eastern Europe in the fifteen years after the fall of the Berlin Wall and the adoption of liberal democratic political systems in the region. It highlights the deepseated gender stereotypes that define women primarily as wives and mothers, with electoral politics seen as an appropriate activity for men, but less so for women. The article explores the ways in which conservative attitudes on gender roles hinders the supply of, and demand for, women in the politics of Central and Eastern Europe. It also discusses the manner in which the internalisation of traditional gender norms affects women’s parliamentary behaviour, as few champion women’s rights in the legislatures of the region. The article also finds that links between women MPs and women’s organisations are weak and fragmented, making coalition-building around agendas for women’s rights problematic.

Dynamic Job Scheduling on the Grid Environment using the Great Deluge Algorithm

The utilization of the computational Grid processor network has become a common method for researchers and scientists without access to local processor clusters to avail of the benefits of parallel processing for compute-intensive applications. As a result, this demand requires effective and efficient dynamic allocation of available resources. Although static scheduling and allocation techniques have proved effective, the dynamic nature of the Grid requires innovative techniques for reacting to change and maintaining stability for users. The dynamic scheduling process requires quite powerful optimization techniques, which can themselves lack the performance required in reaction time for achieving an effective schedule solution. Often there is a trade-off between solution quality and speed in achieving a solution. This paper presents an extension of a technique used in optimization and scheduling which can provide the means of achieving this balance and improves on similar approaches currently published.

Job Search Methods and Outcomes

Using Portuguese data, this paper investigates the effects of job search methods on escape rates from unemployment and of job-finding methods on earnings. The effectiveness of the job search process is also evaluated in terms of the periodicity of the resulting job match. Emphasis is accorded the role of the public employment service. Despite its frequency as a search vehicle, the state employment agency is shown to have a low hit rate, and to lead to lower-paying, shorter-lasting jobs.